Computable function - PDFSEARCH.IO - Document Search Engine

Computable function
Results: 170

#	Item
101	Studium przypadku: Church Adam Olszewski UPJP2, Copernicus Center[removed] Add to Reading List Source URL: www.obi.opoka.org.pl Language: English - Date: 2012-12-08 15:07:45 Theoretical computer science Mathematical logic Computable function Church–Turing thesis Function Computability Computability theory Theory of computation Mathematics
102	Computability and Computation Chris Lomont Jun 22,2012 What is computability? Add to Reading List Source URL: www.lomont.org Language: English - Date: 2012-08-09 18:49:47 Mathematics Computer science Computable function Computable number Halting problem Computability Turing machine Algorithm Undecidable problem Theoretical computer science Computability theory Theory of computation
103	pdf version of the entry Turing Machines http://plato.stanford.edu/archives/sum2013/entries/turing-machine/ from the Summer 2013 Edition of the Edward N. Zalta Add to Reading List Source URL: leibniz.stanford.edu Language: English - Date: 2014-06-20 10:34:12 Theory of computation Turing machine Models of computation Alan Turing Computability Busy beaver Church–Turing thesis Computable function Halting problem Computability theory Theoretical computer science Computer science
104	The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed] Add to Reading List Source URL: www.cs.unibo.it Language: English - Date: 2007-10-31 03:46:45 Mathematics Theory of computation Blum axioms Computable function ELEMENTARY Recursively enumerable set Smn theorem Computational complexity theory Lambda calculus Theoretical computer science Computability theory Applied mathematics
105	Π01 CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV, DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., TIMOTHY MCNICHOLL, AND SARAH PINGREY Abstract. We study the weak tru Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:57:30 Mathematics Computer science Turing reduction Low Computable function Turing degree Function Recursive set Enumeration Computability theory Theoretical computer science Theory of computation
106	Full Abstraction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2004-01-06 12:23:12 Logic Interpretation Structure Monoid Elementary class Function Programming Computable Functions Denotational semantics Mathematics Model theory Mathematical logic
107	GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-15 20:06:55 Mathematics Computer science Computable function Recursive set Computation in the limit Generic-case complexity Turing reduction Halting problem Blum axioms Computability theory Theoretical computer science Theory of computation
108	ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-07-19 19:14:33 Mathematics Computer science Computable function Recursive set Recursively enumerable set Enumeration Generic-case complexity Halting problem Low Computability theory Theory of computation Theoretical computer science
109	DIAGONALLY NON-COMPUTABLE FUNCTIONS AND BI-IMMUNITY CARL G. JOCKUSCH, JR. AND ANDREW E.M. LEWIS Abstract. We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-02 15:47:48 Applied mathematics Computable function Turing reduction Reduction Algorithmically random sequence Function Computability theory Mathematics Computer science
110	ASYMPTOTIC DENSITY, COMPUTABLE TRACEABILITY, AND 1-RANDOMNESS URI ANDREWS, MINGZHONG CAI, DAVID DIAMONDSTONE, CARL JOCKUSCH, AND STEFFEN LEMPP Abstract. Let r be a real number in the unit interval [0, 1]. A set A ⊆ ω Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2014-02-03 11:22:22 Mathematics Computable function Algorithmically random sequence Busy beaver Theory of computation Computability theory Applied mathematics

UPDATE